Unbounded Dependency: Tying strings to rings

نویسنده

  • Jon M. Slack
چکیده

This paper outlines a framework for connectionist representation based on the composition of connectionist states under vector space operators. The framework is used to specify a level of connectionist structure defined in terms of addressable superposition space hierarchies. Direct and relative address systems (:an be defined for such structures which use the functional components of linguistic structures as labels. Unbounded dependency phenomena are shown to be related to the different properties of these labelling structures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Plausibility and the Processing of Unbounded Dependencies: An Eye-Tracking Study

Two eye-tracking experiments investigated processing of unbounded dependency constructions. Experiment 1 employed sentences like That’s the garage/pistol with which the heartless killer shot the man yesterday afternoon. Readers experienced greater processing difficulty in implausible sentences than in plausible sentences immediately after encountering the verb shot. This demonstrated that they ...

متن کامل

Evaluation of Dependency Parsers on Unbounded Dependencies

We evaluate two dependency parsers, MSTParser and MaltParser, with respect to their capacity to recover unbounded dependencies in English, a type of evaluation that has been applied to grammarbased parsers and statistical phrase structure parsers but not to dependency parsers. The evaluation shows that when combined with simple post-processing heuristics, the parsers correctly recall unbounded ...

متن کامل

The Shared Logistic Normal Distribution for Grammar Induction

We present a shared logistic normal distribution as a Bayesian prior over probabilistic grammar weights. This approach generalizes the similar use of logistic normal distributions [3], enabling soft parameter tying during inference across different multinomials comprising the probabilistic grammar. We show that this model outperforms previous approaches on an unsupervised dependency grammar ind...

متن کامل

Reverse Long-distance Dependency and Functional Uncertainty - The Interpretation of Mandarin Questions

Mandarin Chinese WH-questions exhibit two syntactically interesting characteristics. First, WH-words that bear interrogative information always occur in situ. Second, in spite the above fact, I find that Mandarin WH-questions, with bounded WH-words, share the grammatical behaviors common to questions with unbounded and dislocated WH-words in other languages. Hence, intuitively, an account of Ma...

متن کامل

Reverse Long-distance Dependency and Functional

Mandarin Chinese WH-questions exhibit two syntactically interesting characteristics. First, WH-words that bear interrogative information always occur in situ.Second, in spite the above fact, I find that Mandarin WH-questions, with bounded WH-words, share the grammatical behaviors common to questions with unbounded and dislocated WH-words in other languages.Hence,intuitively,an account of Mandar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990